linked list search造句

With D registers, the D [ 2 ] register points at the base of the lexical level 2 environment, and all we need to do to generate the address of the variable is to add its offset from the stack frame base to the frame base address in the D register . ( There is an efficient linked list search operator LLLU, which could search the stack in the above fashion, but the D register approach is still going to be faster . ) With D registers, access to entities in outer and global environments is just as efficient as local variable access.
It's difficult to find linked list search in a sentence. 用linked list search造句挺难的